Sharp Davies–Gaffney–Grigor’yan Lemma on graphs
نویسندگان
چکیده
منابع مشابه
On Sharp Thresholds in Random Geometric Graphs
We give a characterization of vertex-monotone properties with sharp thresholds in a Poisson random geometric graph or hypergraph. As an application we show that a geometric model of random k-SAT exhibits a sharp threshold for satisfiability.
متن کاملSzemerédi’s Regularity Lemma for Sparse Graphs
A remarkable lemma of Szemerédi asserts that, very roughly speaking, any dense graph can be decomposed into a bounded number of pseudorandom bipartite graphs. This far-reaching result has proved to play a central rôle in many areas of combinatorics, both ‘pure’ and ‘algorithmic.’ The quest for an equally powerful variant of this lemma for sparse graphs has not yet been successful, but some prog...
متن کاملA probabilistic counting lemma for complete graphs
We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerédi’s Regularity Lemma. More precisely, we consider the number of complete graphs K` on ` vertices in `-partite graphs where each partition class consists of n vertices and there is an ε-regular graph onm edges between any two partition classes. We show that for all β >...
متن کاملSome sharp bounds on the negative decision number of graphs
Let G = (V,E) be a graph. A function f : V → {−1, 1} is called a bad function of G if ∑ u∈NG(v) f(u) ≤ 1 for all v ∈ V , where NG(v) denotes the set of neighbors of v in G. The negative decision number of G, introduced in [12], is the maximum value of ∑ v∈V f(v) taken over all bad functions of G. In this paper, we present sharp upper bounds on the negative decision number of a graph in terms of...
متن کاملSome Sharp Upper Bounds on the Spectral Radius of Graphs
In this paper, we first give a relation between the adjacency spectral radius and the Q-spectral radius of a graph. Then using this result, we further give some new sharp upper bounds on the adjacency spectral radius of a graph in terms of degrees and the average 2-degrees of vertices. Some known results are also obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Annalen
سال: 2017
ISSN: 0025-5831,1432-1807
DOI: 10.1007/s00208-017-1529-z